An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains

An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains

We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parallel. Given a set P of h pairwise-disjoint rectilinear polygonal obstacles with a total of n vertices in the plane, a minimumlink rectilinear path between two points is a rectilinear path that avoids all obstacles with ...

Rectilinear Paths among Rectilinear Obstacles

Given a set of obstacles and two distinguished points in the plane the problem of nding a collision free path subject to a certain optimization function is a fundamental problem that arises in many elds, such as motion planning in robotics, wire routing in VLSI and logistics in operations research. In this survey we emphasize its applications to VLSI design and limit ourselves to the rectilinea...

k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane

We present an algorithm for computing k-link rectilinear shortest paths among rectilinear obstacles in the plane. We extend the “continuous Dijkstra” paradigm to store the link distance information associated with each propagating “wavefront”. Our algorithm runs in time O(kn log n) and space O(kn), where n is the number of vertices of the obstacles. Previous algorithms for the problem had worst...

An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem

Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane

Given a rectilinear domain P of h pairwise-disjoint rectilinear obstacles with a total of n vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points s and t in P. Three types of bicriteria rectilinear paths are considered: minimum-link shortest paths, shortest minimum-link paths, and minimum-cost paths where the cost of a path is a non-de...